Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
نویسندگان
چکیده
منابع مشابه
Iterative Methods for Eigenvalues of Symmetric Matrices as Fixed Point Theorems
Thus far in my research I have begun to study the theoretical groundwork for what will become our iterative procedures to determine eigenvalues of Symmetric Matrices. Throughout this midterm report I will describe in detail the different areas of mathematics I have studied throughout the first half of this project, which will become the Mathematical framework used in our research. Currently the...
متن کاملSymmetric tensor decomposition by an iterative eigendecomposition algorithm
We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only eigendecompositions and least-squares fitting. Originally designed for quartic (4th-order) symmetric tensors, STEROID is shown to be applicable to any order throug...
متن کاملFastISA: A fast fixed-point algorithm for independent subspace analysis
Independent Subspace Analysis (ISA; Hyvarinen & Hoyer, 2000) is an extension of ICA. In ISA, the components are divided into subspaces and components in different subspaces are assumed independent, whereas components in the same subspace have dependencies.In this paper we describe a fixed-point algorithm for ISA estimation, formulated in analogy to FastICA. In particular we give a proof of the ...
متن کاملA Fast Fixed-Point Algorithm for Independent Component Analysis
We introduce a novel fast algorithm for Independent Component Analysis, which can be used for blind source separation and feature extraction. It is shown how a neural network learning rule can be transformed into a xed-point iteration, which provides an algorithm that is very simple, does not depend on any user-deened parameters, and is fast to converge to the most accurate solution allowed by ...
متن کاملA divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
We present a fast and numerically stable algorithm for computing the eigendecom-position of a symmetric block diagonal plus semiseparable matrix. We report numerical experiments that indicate that our algorithm is signiicantly faster than the standard method which treats the given matrix as a general symmetric dense matrix.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JSIAM Letters
سال: 2020
ISSN: 1883-0609,1883-0617
DOI: 10.14495/jsiaml.12.5